Cryptanalysis of Some Double-Block-Length Hash Modes of Block Ciphers with n-Bit Block and n-Bit Key
نویسندگان
چکیده
In this paper, we make attacks on DBL (Double-Block-Length) hash modes of block ciphers with n-bit key and n-bit block. Our preimage attack on the hash function of MDC-4 scheme requires the time complexity 2, which is significantly improved compared to the previous results. Our collision attack on the hash function of MJH scheme has time complexity less than 2 for n = 128. Our preimage attack on the compression function of MJH scheme find a preimage with time complexity of 2. It is converted to a preimage attack on the hash function with time complexity of 2. Our preimage attack on the compression function of Mennink’s scheme find a preimage with time complexity of 2. It is converted to a preimage attack on the hash function with time complexity of 2. These attacks are helpful for understanding the security of the hash modes together with their security proofs.
منابع مشابه
Cryptanalysis of Double-Block-Length Hash Mode MJH
A double-block-length (DBL) hash mode of block ciphers, MJH has been proved to be collision-resistant in the ideal cipher model upto 22n/3−log n queries. In this paper we provide first cryptanalytic results for MJH. We show that a collision attack on MJH has the time complexity below the birthday bound. When block ciphers with 128-bit blocks are used, it has time complexity around 2, which is t...
متن کاملHeW: a Hash Function based on lightweight Block cipher FeW
A new hash function HeW: A hash function based on light weight block cipher FeW is proposed in this paper. The compression function of HeW is based on block cipher FeW. It is believed that key expansion algorithm of block cipher slows down the performance of the overlying hash function. Thereby, block ciphers become a less favourable choice to design a compression function. As a countermeasure,...
متن کاملA Collision-Resistant Rate-1 Double-Block-Length Hash Function
This paper proposes a construction for collision resistant 2n-bit hash functions, based on n-bit block ciphers with 2n-bit keys. The construction is analysed in the ideal cipher model; for n = 128 an adversary would need roughly 2 units of time to find a collision. The construction employs “combinatorial” hashing as an underlying building block (like Universal Hashing for cryptographic message ...
متن کاملOptimal Collision Security in Double Block Length Hashing with Single Length Key
The idea of double block length hashing is to construct a compression function on 2n bits using a block cipher with an n-bit block size. All optimally secure double length hash functions known in the literature employ a cipher with a key space of double block size, 2n-bit. On the other hand, no optimally secure compression functions built from a cipher with an n-bit key space are known. Our wor...
متن کاملKnown Plaintext Cryptanalysis of Tree-structured Block Ciphers
In this Letter we examine the cryptanalysis of a class of block ciphers referred to as substitution-permutation networks or SPNs. Speciically, we present a novel attack applicable to tree-structured SPNs. Because it uses a known plaintext approach, the attack is preferable to previously outlined chosen plaintext attacks. As well, it is shown that the attack is applicable to networks which are s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IACR Cryptology ePrint Archive
دوره 2013 شماره
صفحات -
تاریخ انتشار 2013